package org.example;

public class Test2 {
    //leetcode 62 不同路径 https://leetcode.cn/problems/unique-paths/description/
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m + 1][n + 1];
        dp[1][0] = 1;
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m][n];
    }

    public static void main(String[] args) {
        Test2 test2 = new Test2();
        test2.uniquePaths(3,2);
        System.out.println(555);
    }
}
